Chromatic Edge Strength of Some Multigraphs
نویسندگان
چکیده
The edge strength s(G) of a multigraph G is the minimum number of colors in a minimum sum edge coloring of G. We give closed formulas for the edge strength of bipartite multigraphs and multicycles. These are shown to be classes of multigraphs for which the edge strength is always equal to the chromatic index.
منابع مشابه
Some maximum multigraphs and adge/vertex distance colourings
Shannon–Vizing–type problems concerning the upper bound for a distance chromatic index of multigraphs G in terms of the maximum degree ∆(G) are studied. Conjectures generalizing those related to the strong chromatic index are presented. The chromatic d–index and chromatic d–number of paths, cycles, trees and some hypercubes are determined. Among hypercubes, however, the exact order of their gro...
متن کاملIrregular embeddings of multigraphs with fixed chromatic number
Let G be a c-chromatic multigraph (c >t 2) with maximum edge multiplicity s. In this note we show that G has an embedding as an induced subgraph, into some degree irregular c-chromatic multigraph having the same maximum edge multiplicity.
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملThe chromatic index of multigraphs of order at most 10
The maximum of the maximum degree and the 'odd set quotients' provides a well-known lower bound 4)(G) for the chromatic index of a multigraph G. Plantholt proved that if G is a multigraph of order at most 8, its chromatic index equals qS(G) and that if G is a multigraph of order 10, the chromatic index of G cannot exceed qS(G) + 1. We identify those multigraphs G of order 9 and 10 whose chromat...
متن کاملAsymptotics of the total chromatic number for multigraphs
For loopless multigraphs, the total chromatic number is asymptotically its fractional counterpart as the latter invariant tends to infinity. The proof of this is based on a recent theorem of Kahn establishing the analogous asymptotic behaviour of the list-chromatic index for multigraphs. The total colouring conjecture, proposed independently by Behzad [1] and Vizing [11], asserts that the total...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 30 شماره
صفحات -
تاریخ انتشار 2008